Zeta Functions for Images of Graph Coverings by Some Operations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zeta Functions of Graph Coverings

Graphs and digraphs treated here are finite and simple. Let G be a connected graph and D the symmetric digraph corresponding to G. A path P of length n in D(G) is a sequence P=(v0 , v1 , ..., vn&1 , vn) of n+1 vertices and n arcs (edges) such that consecutive vertices share an arc (edge) (we do not require that all vertices are distinct). Also, P is called a (v0 , vn)-path. The subdigraph (subg...

متن کامل

Weighted Zeta Functions of Graph Coverings

We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighted zeta function of an (irregular or regular) covering of a graph by equivalence classes of prime, reduced cycles of the base graph. As an application, we discuss the structure of balanced coverings of signed graphs.

متن کامل

Some graph properties determined by edge zeta functions

Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of H...

متن کامل

Isomorphisms of some graph coverings

Let G be a connected graph and r a group of automorphisms of G. We enumerate the number of r-isomorphism classes of derived graph coverings of G with voltages in a finite field of prime order P (>2).

متن کامل

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Interdisciplinary Information Sciences

سال: 2001

ISSN: 1347-6157,1340-9050

DOI: 10.4036/iis.2001.53